Further Reductions for thek(GV)-Problem
نویسندگان
چکیده
منابع مشابه
Further Reductions of Normal Forms for Dynamical Systems
We propose in this paper a method for obtaining a significant refinement of normal forms for dynamical systems or vector fields, with concrete and interesting applications. We use lower order nonlinear terms in the normal form for the simplifications of higher order terms. Our approach is applicable for both the non nilpotent and the nilpotent cases. For dynamical systems of dimensions 2 and 3 ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFurther Reductions of Poincaré-dulac Normal Forms in C
In this paper, we will consider (germs of) holomorphic mappings of the form (f(z), λ1w1(1 + g1(z)), . . . , λnwn(1 + gn(z))), defined in a neighborhood of the origin in Cn+1. Most of our interest is in those mappings where f(z) = z+ amz + · · · is a germ tangent to the identity and gi(0) = 0 for i = 1, . . . , n, and λi ∈ C possess no resonances, for these are the so-called PoincaréDulac normal...
متن کاملReductions of the general virus detection problem
Ferenc Leitold has graduated at Technical University of Budapest in 1991. He received his Ph.D. at Technical University of Budapest too, in 1997 in the theme of computer viruses. Currently he teaches in the Department of Information Systems at Veszprém University. He teaches computer programming, computer security and computer networks. His research interest is based on computer viruses: mathem...
متن کاملCrown reductions for the Minimum Weighted Vertex Cover problem
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. ([20], [1]). We describe in detail a close relation of crown reductions to Nemhauser and Trotter reductions that are based on the linear programming relaxation of the problem. We introduce and study the so called strong crown reductions, suitable for find...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1997
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.7085